Predicate inversion and Englishthere-sentences
نویسندگان
چکیده
منابع مشابه
Automatic Identification of Predicate Heads in Chinese Sentences
We propose an effective approach to automatically identify predicate heads in Chinese sentences based on statistical pre-processing and rule-based post-processing. In the preprocessing stage, the maximal noun phrases in a sentence are recognized and replaced by “NP” labels to simplify the sentence structure. Then a CRF model is trained to recognize the predicate heads of this simplified sentenc...
متن کاملSeparating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
We consider intermediate predicate logics defined by fixed well-ordered (or dually well-ordered) linear Kripke frames with constant domains where the order-type of the well-order is strictly smaller than ω. We show that two such logics of different order-type are separated by a first-order sentence using only one monadic predicate symbol. Previous results by Minari, Takano and Ono, as well as t...
متن کاملProcessing of sentences with predicate negation: The role of opposite predicates
In this paper we discuss the two-step simulation hypothesis of negation processing proposed by Kaup et al. [3,4] with regard to negating two sorts of predicates: those with clear opposites (“long” vs “short”, “closed” vs “open”) and those without clear opposites (“red”, “triangle”). The hypothesis by Kaup et alia predicts that negation is integrated into sentence meaning on the later stage of s...
متن کامل"Linguistic" sentences and "real" sentences
This p~$r Id~ntift~ iwe klr¢ds of sentences: "llngulsUc" sentences ~ J "r~al" a~-ntence~. "l't~,~ former is a kind of sentel~'~,e~ that ar~ often discussed in (cemputatkmal) Ungulstlc literatures, sucll as the:re In i:lgure 1. The latter, on the other hand, is a kind of senteace=~ that appear in practical applications, such as those In Flgu='e 2. Where~ts both are grammatical English sentences,...
متن کاملPredicate Subtyping with Predicate Sets
We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets, and explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL, and also demonstrate some limits of the approach. Finally we report on the effectiveness of a subtype checker used as a condition prover in a contextual rewriter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Linguistica Hungarica
سال: 2011
ISSN: 1216-8076,1588-2624
DOI: 10.1556/aling.58.2011.3.2